The Performance of Block Codes, Volume 49, Number 1

نویسنده

  • Elwyn Berlekamp
چکیده

I n his classic 1948 paper [10], Claude Shannon introduced the notions of communication channels and codes to communicate over them. During the following two decades, he remained active in refining and extending the theory. One of Shannon’s favorite research topics was the fundamental performance capabilities of long block codes. In the 1950s and 1960s this topic also attracted the active involvement of several of Shannon’s distinguished colleagues both at Bell Telephone Laboratories and at MIT, including P. Elias, R. M. Fano, R. G. Gallager, E. N. Gilbert, R. W. Hamming, I. M. Jacobs, B. Reiffen, D. Slepian, and J. M. Wozencraft, and several graduate students, including G. D. Forney and me. The work culminated in a book by Gallager [6] and in a sequence of two “Information and Control” papers by Shannon, Gallager, and Berlekamp [11]. In this article I present an overview of some of the more salient results and their impact.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Orthogonal Space-Time-Frequency Block Codes over a MIMO-OFDM Frequency Selective Channel

In this paper, a cooperative algorithm to improve the orthogonal space-timefrequency block codes (OSTFBC) in frequency selective channels for 2*1, 2*2, 4*1, 4*2 MIMO-OFDM systems, is presented. The algorithm of three node, a source node, a relay node and a destination node is formed, and is implemented in two stages. During the first stage, the destination and the relay antennas receive the sym...

متن کامل

Seven new champion linear codes

We exhibit seven linear codes exceeding the current best known minimum distance d for their dimension k and block length n. Each code is defined over F8, and their invariants [n, k, d] are given by [49, 13, 27], [49, 14, 26], [49, 16, 24], [49, 17, 23], [49, 19, 21], [49, 25, 16] and [49, 26, 15]. Our method includes an exhaustive search of all monomial evaluation codes generated by points in t...

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

New multilevel codes over GF(q)

In this paper, we apply set partitioning to multi-dimensional signal spaces over GF(q), particularly GFq-l(q) and GFq(q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). We present two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum ,1-1 • { d } distance d_n >_ d, where n =...

متن کامل

تجزیه و تحلیل عملکرد کدهای کانولوشنال تعریف شده در میدان حقیقی در کانال فیدینگ و در حضور نویز کوانتیزاسیون

Channel coding is one of the techniques used for suppression of fading and channel noise effects. Most of the researches on channel codes have been focused on the codes which are defined on Galois fields. Since two decades ago, using channel codes defined on Real and Complex fields has been considered for joint sourcechannel coding in multimedia transmission; but most of the works have focused ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001